A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic
نویسندگان
چکیده
We present a Schütte-Tait style cut-elimination proof for the hypersequent calculus HIF for first-order Gödel logic. This proof allows to bound the depth of the resulting cut-free derivation by 4 |d| ρ(d), where |d| is the depth of the original derivation and ρ(d) the maximal complexity of cut-formulas in it. We compare this Schütte-Tait style cut-elimination proof to a Gentzen style proof.
منابع مشابه
A cut-free calculus for second-order Gödel logic
We prove that the extension of the known hypersequent calculus for standard first-order Gödel logic with usual rules for second-order quantifiers is sound and (cut-free) complete for Henkin-style semantics for second-order Gödel logic. The proof is semantic, and it is similar in nature to Schütte and Tait’s proof of Takeuti’s conjecture.
متن کاملSufficient conditions for cut elimination with complexity analysis
Sufficient conditions for first order based sequent calculi to admit cut elimination by a Schütte-Tait style cut elimination proof are established. The worst case complexity of the cut elimination is analysed. The obtained upper bound is parameterized by a quantity related with the calculus. The conditions are general enough to be satisfied by a wide class of sequent calculi encompassing, among...
متن کاملProof theory of witnessed Gödel logic: A negative result
We introduce a first sequent-style calculus for witnessed Gödel logic. Our calculus makes use of the cut rule. We show that this is inescapable by establishing a general result on the non-existence of suitable analytic calculi for a large class of first-order logics. These include witnessed Gödel logic, (fragments of) Łukasiewicz logic, and intuitionistic logic extended with the quantifiers of ...
متن کاملCut Elimination for First Order Gödel Logic by Hyperclause Resolution
Efficient, automated elimination of cuts is a prerequisite for proof analysis. The method CERES, based on Skolemization and resolution has been successfully developed for classical logic for this purpose. We generalize this method to Gödel logic, an important intermediate logic, which is also one of the main formalizations of fuzzy logic.
متن کاملRevantha Ramanayake Cut - elimination for Weak Grzegorczyk Logic Go
We present a syntactic proof of cut-elimination for weak Grzegorczyk logic Go. The logic has a syntactically similar axiomatisation to Gödel–Löb logic GL (provability logic) and Grzegorczyk’s logic Grz. Semantically, GL can be viewed as the irreflexive counterpart of Go, and Grz can be viewed as the reflexive counterpart of Go. Although proofs of syntactic cut-elimination for GL and Grz have ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002